Generalized convexity in mathematical programming
نویسندگان
چکیده
منابع مشابه
Second Order Duality in Multiobjective Programming With Generalized Convexity
The purpose of this paper is concerned with a class of multi objective programming problems in which the objective functions and constrained functions are twice differentiable and containing the support functions of a compact convex set. For such mathematic programming, to deal with its dual problem, first, the concept of second order ( , ) B p r invexity is introduced. Further, the Mangasa...
متن کاملDuality in nondifferentiable minimax fractional programming with generalized convexity
A Mond–Weir type dual for a class of nondifferentiable minimax fractional programming problem is considered. Appropriate duality results are proved involving (F,a,q,d)-pseudoconvex functions. 2005 Elsevier Inc. All rights reserved.
متن کاملDuality for Nondifferentiable Multiobjective Semi-infinite Programming with Generalized Convexity
The purpose of this paper is to consider the Mond-Weir type dual model for a class of non-smooth multiobjective semi-infinite programming problem. In this work, we use generalization of convexity namely ( , ) G F θ − convexity and Kuhn-Tucker constraint qualification, to prove new duality results for such semi-infinite programming problem. Weak, strong and converse duality theorems are derived....
متن کاملGeneralized Second-Order Mixed Symmetric Duality in Nondifferentiable Mathematical Programming
and Applied Analysis 3 It can be easily seen that for a compact convex set C, y is in NC x if and only if S y | C xy, or equivalently, x is in ∂S y | C . Definition 2.2. A functional F : X × X × R → R where X ⊆ R is sublinear with respect to the third variable if for all x, u ∈ X ×X, i F x, u; a1 a2 ≤ F x, u; a1 F x, u; a2 for all a1, a2 ∈ R, ii F x, u;αa αF x, u; a , for all α ∈ R and for all ...
متن کاملRiemannian Convexity in Programming (II)
The book [7] emphasizes three relevant aspects: first, the fact that the notion of convexity is strongly metric-dependent either through geodesics or through the Riemannian connection; second that Riemannian convexity of functions is a coordinate-free concept, and consequently it can be easily connected with symbolic computation; third, that the Riemannian structure is involved essentially in f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1983
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700025661